#include<iostream>
#define D1(i) P1(i);
#define D2(i) D1(i);if(i+1<n){D1(i+1);}
#define D4(i) D2(i);if(i+2<n){D2(i+2);}
#define D8(i) D4(i);if(i+4<n){D4(i+4);}
#define DA(i) D8(i);if(i+8<n){D8(i+8);}  /// DA: D16
#define DB(i) DA(i);if(i+16<n){DA(i+16);} /// DB: D32
#define DC(i) DB(i);if(i+32<n){DB(i+32);} /// DC: D64
#define DD(i) DC(i);if(i+64<n){DC(i+64);} /// DD: D128
#define DE(i) DD(i);if(i+128<n){DD(i+128);} /// DE: D256
#define DF(i) DE(i);if(i+256<n){DE(i+256);} /// DF: D512
#define DG(i) DF(i);if(i+512<n){DF(i+512);} /// DG: D1024
#define DH(i) DG(i);if(i+1024<n){DG(i+1024);} /// DH: D2048
#define DI(i) DH(i);if(i+2048<n){DH(i+2048);} /// DI: D4096
using namespace std;
const int N = 5000;
float res, nums[N], sum1, sum2;
int n = 2048;
inline void P1(int i) {
    sum1 += nums[2 * i];
    sum2 += nums[2 * i + 1];
}
int main() {
    int m = 100;
    while (m--) {
        for (int i = 0; i < N; ++i)nums[i] = i + 1;
        res = 0; sum1 = sum2 = 0;
        DH(0);
        res = sum1 + sum2;
    }
    
}
